Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem

A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem

We consider the Commodity constrained Split Delivery Vehicle Routing Problem (CSDVRP), a routing problem where customers may request multiple commodities. The vehicles can deliver any set of commodities, and multiple visits to a customer are allowed only if the customer requests multiple commodities. If the customer is visited more than once, the different vehicles will deliver different sets o...

Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows

The Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact Mixed-Integer Programming (MIP) formulation for the SDVRPTW. Standard modeling approach either suffer from inherent symmetries (MIPs with a vehicle index) or cannot exactly capture all aspects of feasibility. Due to the possi...

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery

This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time ...

Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost

This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weightrelated cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time ...

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing